To Compute the Optimal Interpolation Formula
نویسندگان
چکیده
The purpose of this paper is to explain how to compute the function Í2 which interpolates values of a function of one variable fix) at n distinct points x, ik) < x2 < ■ • • < *n_i < x„, and which, whenever ll/v 'H^ is bounded and the value of the bound is unknown, provides the smallest possible value of Bix) in the error bound \fix) Í2(x)l < B(*)ll/(fc)lloo
منابع مشابه
An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملQuantifier Elimination in Second-Order Predicate Logic
An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pnψ where ψ is an arbitrary formula of first– order predicate logic. The resulting formula is equivalent to the original formula – if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second–order quantifiers in circ...
متن کاملMean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ2-Frege (i.e. DNF-resolution). This reduces mean-payoff games to the weak automatizability of Σ2-Frege, and to the interpolation problem for Σ...
متن کاملNear-optimal interpolation and quadrature in two variables: the Padua points∗
The Padua points are the first known example of optimal points for total degree polynomial interpolation in two variables, with a Lebesgue constant increasing like log of the degree; cf. [1, 2, 3]. Moreover, they generate a nontensorial Clenshaw-Curtis-like cubature formula, which turns out to be competitive with the tensorial Gauss-Legendre formula and even with the few known minimal formulas ...
متن کاملApplication of semi-analytic method to compute the moments for solution of logistic model
The population growth, is increase in the number of individuals in population and it depends on some random environment effects. There are several different mathematical models for population growth. These models are suitable tool to predict future population growth. One of these models is logistic model. In this paper, by using Feynman-Kac formula, the Adomian decomposition method is applied to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010